An O(N) iterative solution to the Poisson equation in low-level vision problems

In this paper, we present a novel iterative numerical solution to the Poisson equation whose solution is needed in a variety of low-level vision problems. Our algorithm is an O(N) (N being the number of discretization points) iterative technique and does not make any assumptions on the shape of the input domain unlike the polyhedral domain assumption in the proof of convergence of multi-grid techniques 28, 29]. We present two major results namely, a generalized version of the capacitance matrix theorem 6] and a theorem on O(N) convergence of the alternating direction implicit method (ADI) used in our algorithm. Using this generalized theorem, we express the linear system corresponding to the discretized Poisson equation as a Lyapunov and a Capacitance matrix equation. The former is solved using the ADI method while the solution to the later is obtained using a modiied bi-conjugate gradient algorithm. We demonstrate the algorithm performance on synthesized data for the surface reconstruction and the SFS problems.